#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 3e4 + 5;

int n, m;
int a[N];
int dp[N];
void solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  sort(a + 1, a + n + 1);
  n = unique(a + 1, a + n + 1) - a - 1;
  m = a[n];
  rep(i, 1, m) dp[i] = 0;
  int cnt = 0;
  rep(i, 1, n) {
    if (dp[a[i]] == a[i]) continue;
    cnt++;
    rep(j, a[i], m) dp[j] = max(dp[j], dp[j - a[i]] + a[i]);
  }
  cout << cnt << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}